Traffic Control Problems using Graph Connectivity
نویسنده
چکیده
In modern day automobile traffic the problem of traffic congestion calls for the design of efficient control strategies. In this paper it is argued that in order to have efficient and systematic solutions to a traffic control problem at an intersection, graph theoretic models of the problem are quite appropriate for its exploitation. Connectivity of compatibility graph of a traffic intersection can be used to study the most efficient route or the traffic control system to direct the traffic flow to its maximum capacity using the minimum number of edges or the minimum number of vertices. This result has got application in traffic control problems at an arbitrary intersection so as to minimize the waiting time of the traffic participants and the cost of locating the sensors in order to collect traffic data.
منابع مشابه
Identification of mild cognitive impairment disease using brain functional connectivity and graph analysis in fMRI data
Background: Early diagnosis of patients in the early stages of Alzheimer's, known as mild cognitive impairment, is of great importance in the treatment of this disease. If a patient can be diagnosed at this stage, it is possible to treat or delay Alzheimer's disease. Resting-state functional magnetic resonance imaging (fMRI) is very common in the process of diagnosing Alzheimer's disease. In th...
متن کاملکاربرد تئوری گرف در مطالعات اکولوژی سیمای سرزمین نمونه موردی: سنجش پیوستگی زیستگاههای کلانشهر ملبورن
A new method to quantify, monitore and assess ecological structures and functions is the application of graph theory. In ecology, this theory demonstrates its suitable application in assessment of ecological connectivity. Connectivity is the structural attribute of landscape which facilitates the species movement among their habitats. Using graph theory, this paper aims to assess the connectivi...
متن کاملA note on connectivity and lambda-modified Wiener index
In theoretical chemistry, -modified Wiener index is a graph invariant topological index to analyze the chemical properties of molecular structure. In this note, we determine the minimum -modified Wiener index of graph with fixed connectivity or edge-connectivity. Our results also present the sufficient and necessary condition for reaching the lower bound.
متن کاملOn the Szeged and Eccentric connectivity indices of non-commutative graph of finite groups
Let $G$ be a non-abelian group. The non-commuting graph $Gamma_G$ of $G$ is defined as the graph whose vertex set is the non-central elements of $G$ and two vertices are joined if and only if they do not commute.In this paper we study some properties of $Gamma_G$ and introduce $n$-regular $AC$-groups. Also we then obtain a formula for Szeged index of $Gamma_G$ in terms of $n$, $|Z(G)|$ and $|G|...
متن کاملOn Second Atom-Bond Connectivity Index
The atom-bond connectivity index of graph is a topological index proposed by Estrada et al. as ABC (G) uvE (G ) (du dv 2) / dudv , where the summation goes over all edges of G, du and dv are the degrees of the terminal vertices u and v of edge uv. In the present paper, some upper bounds for the second type of atom-bond connectivity index are computed.
متن کامل